Dynamic Group Key Agreement in Tree-Based Setting
نویسندگان
چکیده
We present a provably secure tree based authenticated group key agreement protocol in dynamic scenario. Bilinear pairing and multi-signature are at the heart of our protocol. We prove that our protocol is provably secure in the standard security model of Bresson et al. An appropriate modification of Katz-Yung approach to tree based setting is adopted while proving its security against active adversaries. The protocol has an in-built hierarchical structure that makes it desirable for certain applications.
منابع مشابه
Secure and Efficient Tree-based Group Diffie-Hellman Protocol
Current group key agreement protocols (often tree-based) involve unnecessary delays because members with low-performance computer systems can join group key computation. These delays are caused by the computations needed to balance a key tree after membership changes. An alternate approach to group key generation that reduces delays is the dynamic prioritizing mechanism of filtering low perform...
متن کاملGroup Key Agreement Protocol for MANETs Based on HSK Scheme
In this paper, we first provide a spanning tree (ST)-based centralized group key agreement protocol for unbalanced mobile Ad Hoc networks (MANETs). Based on the centralized solution, a local spanning tree (LST)-based distributed protocol for general MANETs is subsequently presented. Both protocols follow the basic features of the HSK scheme: 1) H means that a hybrid approach, which is the combi...
متن کاملA Novel Approach towards Cost Effective Region-Based Group Key Agreement Protocol for Secure Group Communication
This paper addresses an interesting security problem in wireless ad hoc networks: the Dynamic Group Key Agreement key establishment. For secure group communication in an Ad hoc network, a group key shared by all group members is required. This group key should be updated when there are membership changes (when the new member joins or current member leaves) in the group. In this paper, We propos...
متن کاملAn Authenticated Clustering-based Group Key Agreement for Large Ad Hoc Networks
Group key agreement protocols for wired networks are not applicable in ad hoc networks because of the 1-hop assumption of these protocols and the dynamic, multi-hop attributes of ad hoc networks. An authenticated group key agreement for ad hoc networks is proposed which arranges the group members in a cluster-based hierarchical spanning tree structure. The scheme uses Intra-cluster group key ag...
متن کاملA Key Agreement for Large Group Using Bilinear Maps
A key agreement scheme for large dynamic multicast group systems has been designed to cope with such applications including pay-tv, teleconferencing, collaborative work, online games, and so forth. To avoid heavy loads and unauthorized accesses to the system, it is necessary to construct an efficient and secure scheme. Some recently released schemes have tree-based underlying structures. The ef...
متن کامل